Sweeping up zeta

Sweeping up health reform's piles of unfinished business.

Cut Sweeping

This paper presents a light-weight sweeping method, similar to SATand BDD-sweeping. Performance are on the order of 10x to 100x faster than SAT-sweeping for large designs, while achieving about 50-90% of the reductions.

Flow on Sweeping Networks

We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the transported quantity in the neighboring cells. A motivation is pedestrian dynamics during panic situations in a small corridor where the propagation of people...

Lecture Notes: Distribution Sweeping

The skyline problem can be easily solved in linear I/Os in 2D space, after sorting the points of P by x-coordinate (think: how). We will show that the 3D version of the problem can also be settled in O(NB logM/B N B ) I/Os. Our description below follows that of [3]. Algorithm. Our algorithm accepts as input a dataset P whose points are sorted by x-coordinate. If N ≤ M (i.e., the memory capacity...

Cache Oblivious Distribution Sweeping

We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems al...